The Bayliss-lsaacson Algorithm and the Constraint Restoration Method are Equivalent

نویسندگان

  • I. M. Navon
  • Angelo Miele
چکیده

Bayliss and Isaacson (1975) method of modifying any given difference scheme so as to ensure total conservation of the appropriate physical invariants is shown to be equivalent to the constraint restoration method of Miele et al. (1968, 1969) subject to the requirement of least-square change of the statevector coordinates. Both methods are applied to enforce conservation of total energy and potential enstrophy in global shallow-water equations models. Some algorithmic differences between the methods are discussed as well as some implications of a posteriori enforcement of conservation of integral invariants on the performance of meteorological numerical weather prediction (NWP) models and the internal energy distribution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal Selection of Induction Heating Capacitance by Genetic Algorithm Considering Dissipation Loss Caused by ESR (TECHNICAL NOTE)

In design of a parallel resonant induction heating system, choosing a proper capacitancefor the resonant circuit is quite important. The capacitance affects the resonant frequency, outputpower, Q-factor, heating efficiency and power factor. In this paper, the role of equivalent seriesresistance (ESR) in the choice of capacitance is significantly recognized. Optimal value of resonancecapacitor i...

متن کامل

Profit maximization solid transportation problem under budget constraint using fuzzy measures

Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...

متن کامل

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

Evaluating the Effectiveness of Integrated Benders Decomposition Algorithm and Epsilon Constraint Method for Multi-Objective Facility Location Problem under Demand Uncertainty

One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. For this aim, a multi-objective facility location allocation model is proposed. In this case, an integrated BDA and epsilon constraint method are proposed and it is shown that how P...

متن کامل

روشی مبتنی بر تئوری گراف جهت تعیین بهینه جزیره ها در فرآیند بازیابی

In this paper, effect of the islands number variation in restoration process is investigated and a graph based method for determination of optimum islands boundaries is presented. Also, the effect of number and location of black-start units on the restoration process is evaluated. In optimization process, objective function is minimizing Energy Not Supplied (ENS) and constraints are voltage mar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1972